Data Publishing against Realistic Adversaries
نویسندگان
چکیده
Privacy in data publishing has received much attention recently. The key to defining privacy is to model knowledge of the attacker – if the attacker is assumed to know too little, the published data can be easily attacked, if the attacker is assumed to know too much, the published data has little utility. Previous work considered either quite ignorant adversaries or nearly omniscient adversaries. In this paper, we introduce a new class of adversaries that we call realistic adversaries who live in the unexplored space in between. Realistic adversaries have knowledge from external sources with an associated stubbornness indicating the strength of their knowledge. We then introduce a novel privacy framework called epsilon-privacy that allows us to guard against realistic adversaries. We also show that prior privacy definitions are instantiations of our framework. In a thorough experimental study with real census data we show that e-privacy allows us to publish data with high utility while defending against strong adversaries.
منابع مشابه
Privacy-preserving data mining in the malicious model
Most of the cryptographic work in privacy-preserving distributed data mining deals with semi-honest adversaries, which are assumed to follow the prescribed protocol but try to infer private information using the messages they receive during the protocol. Although the semi-honest model is reasonable in some cases, it is unrealistic to assume that adversaries will always follow the protocols exac...
متن کاملPpdp-mlt: K−anonymity Privacy Preservation for Publishing Search Engine Logs
In this paper we investigate the problem of protecting privacy for publishing search engine logs. Search engines play a crucial role in the navigation through the vastness of the Web. Privacy-preserving data publishing (PPDP) provides methods and tools for publishing useful information while preserving data privacy. Recently, PPDP has received considerable attention in research communities, and...
متن کاملA On the Practicality of Cryptographic Defenses against Pollution Attacks in Wireless Network Coding
Numerous practical systems based on network coding have been proposed in recent years demonstrating the wide range of benefits of network coding such as increased throughput, reliability, and energy efficiency. However, network coding systems are inherently vulnerable to a severe attack, known as packet pollution, which presents a key obstacle to the deployment of such systems. Several cryptogr...
متن کاملOnions in the Crosshairs
We introduce and investigate targeting adversaries who selectively aack users of Tor or other secure-communication networks. We argue that aacks by such adversaries are more realistic and more signicant threats to those most relying on Tor’s protection than are aacks in prior analyses of Tor security. Previous research and Tor design decisions have focused on protecting against adversaries ...
متن کاملOn the (Im)possibility of Basing Oblivious Transfer and Bit Commitment on Weakened Security Assumptions
We consider the problem of basing Oblivious Transfer (OT) and Bit Commitment (BC), with information theoretic security, on seemingly weaker primitives. We introduce a general model for describing such primitives, called Weak Generic Transfer (WGT). This model includes as important special cases Weak Oblivious Transfer (WOT), where both the sender and receiver may learn too much about the other ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- PVLDB
دوره 2 شماره
صفحات -
تاریخ انتشار 2009